ALGORITHMEN FUER DAS KLASSISCHE MASCHINENBELEGUNGSPROBLEM = ALGORITHME POUR LE PROBLEME DU VOYAGEUR DE COMMERCETERNO J.1972; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1972; VOL. 3; NO 3; PP. 195-201; ABS. ANGL. RUSSE; BIBL. 4 REF.Serial Issue

A transportation problem with a permuted demand vectorMEUSEL, S. G; BURKARD, R. E.Mathematical methods of operations research (Heidelberg). 1999, Vol 50, Num 1, pp 1-7, issn 1432-2994Article

More on systolic line drawingMEGSON, G. M; EVANS, D. J.Parallel computing. 1992, Vol 18, Num 3, pp 355-358, issn 0167-8191Article

Optimizing the cost matrix for approximate string matching using genetic algorithmsPARIZEAU, M; GHAZZALI, N; HEBERT, J.-F et al.Pattern recognition. 1998, Vol 31, Num 4, pp 431-440, issn 0031-3203Article

On the expected number of assignments in reduced matrices for the linear assignment problemNAWIJN, W. M; DORHOUT, B.Operations research letters. 1989, Vol 8, Num 6, pp 329-335, issn 0167-6377Article

Gilmore-Gomory type traveling salesman problemsKABADI, S. N; FAZLE BAKI, M.Computers & operations research. 1999, Vol 26, Num 4, pp 329-351, issn 0305-0548Article